OntoLearn Reloaded: A Graph-Based Algorithm for Taxonomy Induction
نویسندگان
چکیده
منابع مشابه
OntoLearn Reloaded: A Graph-Based Algorithm for Taxonomy Induction
In 2004 we published in this journal an article describing OntoLearn, one of the first systems to automatically induce a taxonomy from documents and Web sites. Since then, OntoLearn has continued to be an active area of research in our group and has become a reference work within the community.1 In this paper we describe our next-generation taxonomy learning methodology, which we name OntoLearn...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملA Metric-based Framework for Automatic Taxonomy Induction
This paper presents a novel metric-based framework for the task of automatic taxonomy induction. The framework incrementally clusters terms based on ontology metric, a score indicating semantic distance; and transforms the task into a multi-criteria optimization based on minimization of taxonomy structures and modeling of term abstractness. It combines the strengths of both lexico-syntactic pat...
متن کاملA Graph-Based Algorithm for Automated Refactoring
Software reuse is advocated for increasing the productivity of software engineers and improving the quality of software. As software-reuse practices are institutionalized, there must be formal techniques and associated methodologies for software engineers to accurately assess and increase the potential and actual reuse of software artifacts. The goal must be to support domain-and-organization r...
متن کاملA Graph Based Davidson Algorithm for the Graph Partitioning Problem
The problem of partitioning a graph such that the number of edges incident to vertices in diierent partitions is minimized, arises in many contexts. Some examples include its recursive application for minimizing ll-in in matrix factorizations and load-balancing for parallel algorithms. Spectral graph partitioning algorithms partition a graph using the eigenvector associated with the second smal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Linguistics
سال: 2013
ISSN: 0891-2017,1530-9312
DOI: 10.1162/coli_a_00146